Is the iterative refinement of eigenelements an expensive technique?
نویسندگان
چکیده
منابع مشابه
Iterative Treebank Refinement
Treebanks are a valuable resource for the training of parsers that perform automatic annotation of unseen data. It has been shown that changes in the representation of linguistic annotation have an impact on the performance of a certain annotation task. We focus on the task of Topological Field Parsing for German using Probabilistic Context-Free Grammars in the present research. We investigate ...
متن کاملAn Iterative Refinement Algorithm for the Minimum Branch Vertices Problem
Dept. of Computer Science, Federal University of Lavras C.P. 3037, CEP 37200-000, Lavras, MG, Brazil [email protected],[email protected] Dept. of Computer Science, Federal University of Minas Gerais C.P. 702, CEP 31270-010, Belo Horizonte, MG, Brazil [email protected],[email protected] Center of Informatics, Federal University of Pernambuco Av. Jornalista Anibal Fernandes, s/n Cidade Un...
متن کاملAn Interval Refinement Technique for Surface Intersection
This paper describes a technique for computing the intersections of two parametric surfaces based on interval arithmetic. The algorithm, which can be stopped and restarted at any point, uses search techniques to refine its description of the intersections progressively. Interval arithmetic provides guaranteed points on the intersection curves to within a user-specified tolerance. These points a...
متن کاملan investigation about the relationship between insurance lines and economic growth; the case study of iran
مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...
15 صفحه اولIs Efficiency Expensive?
We study the simultaneous optimization of efficiency and revenue in pay-per-click keyword auctions in a Bayesian setting. Our main result is that the efficient keyword auction yields near-optimal revenue even under modest competition. In the process, we build on classical results in auction theory to prove that increasing the number of bidders by the number of slots outweighs the benefit of emp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1987
ISSN: 0377-0427
DOI: 10.1016/0377-0427(87)90133-6